Finite Entropy for Multidimensional Cellular Automata
نویسنده
چکیده
Let X = S where G is a countable group and S is a finite set. A cellular automaton (CA) is an endomorphism T : X → X (continuous, commuting with the action of G). Shereshevsky [14] proved that for G = Z with d > 1 no CA can be forward expansive, raising the following conjecture: For G = Z, d > 1 the topological entropy of any CA is either zero or infinite. Morris and Ward [11], proved this for linear CA’s, leaving the original conjecture open. We show that this conjecture is false, proving that for any d there exist a d-dimensional CA with finite, nonzero topological entropy. We also discuss a measure-theoretic counterpart of this question for measure-preserving CA’s.
منابع مشابه
Entropy rate of higher-dimensional cellular automata
We introduce the entropy rate of multidimensional cellular automata. This number is invariant under shift–commuting isomorphisms; as opposed to the entropy of such CA, it is always finite. The invariance property and the finiteness of the entropy rate result from basic results about the entropy of partitions of multidimensional cellular automata. We prove several results that show that entropy ...
متن کاملMultidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملClassification of Sofic Projective Subdynamics of Multidimensional Shifts of Finite Type
Motivated by Hochman’s notion of subdynamics of a Z subshift [8], we define and examine the projective subdynamics of Z shifts of finite type (SFTs) where we restrict not only the action but also the phase space. We show that any Z sofic shift of positive entropy is the projective subdynamics of a Z2 (Z) SFT, and that there is a simple condition characterizing the class of zero-entropy Z sofic ...
متن کاملOn the Measure Entropy of Additive Cellular Automata f∞
We show that for an additive one-dimensional cellular automata on space of all doubly infinitive sequences with values in a finite set S = {0, 1, 2, ..., r-1}, determined by an additive automaton rule f(x ∞ f n-k, ..., xn+k) = (mod r), and a -invariant uniform Bernoulli measure μ, the measure-theoretic entropy of the additive one-dimensional cellular automata with respect to μ is equal to h ∑ −...
متن کاملAlways finite entropy and Lyapunov exponents of two-dimensional cellular automata
Given a new definition for the entropy of a cellular automata acting on a two-dimensional space, we propose an inequality between the entropy of the shift on a two-dimensional lattice and some angular analog of Lyapunov exponents.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007